Turning a rectangle into a square in the Sulbasutras
نویسنده
چکیده
Having desired (to construct) a square, one is to take a cord of length equal to the (side of the) given square, make ties at both ends and mark it at its middle. The (east-west) line (equal to the cord) is drawn and a pole is fixed at its middle. The two ties (of the cord) are fixed in it (pole) and a circle is drawn with the mark (in the middle of the cord). Two poles are fixed at both ends of the diameter (east-west line). With one tie fastened to the eastern (pole), a circle is drawn with the other. A similar (circle) about the western (pole). The second diameter is obtained from the points of intersection of these two (circles); two poles are fixed at two ends of the diameter (thus obtained). With two ties fastened to the eastern (pole) a circle is drawn with the mark. The same (is to be done) with respect to the southern, the western and the northern (pole). The end points of intersection of these (four circles) produce the (required) square.
منابع مشابه
1 9 N ov 2 00 5 Mathematical Table Turning Revisited
We investigate under which conditions a rectangular table can be placed with all four feet on a ground described by a function R 2 → R. We start by considering highly idealized tables that are just simple rectangles. We prove that given any rectangle, any continuous ground and any point on the ground, the rectangle can be positioned such that all its vertices are on the ground and its center is...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملSearch Strategies for Rectangle Packing
Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a variant of an important problem in a variety of real-world settings. For example, in electronic design automation, the packing of blocks into a circuit layout is essentially a rectangle packing problem. Rectangle packi...
متن کاملIntegration of grey-based Taguchi technique in optimization of parameters process during the turning operation of 16MnCr5 steel
CNC turning is widely used as a manufacturing process through which unwanted material is removed to get the high degree of surface rough. In this research article, Taguchi technique was coupled with grey relation analysis (GRA) to optimize the turning parameters for simultaneous improvement of productivity, average surface roughness (Ra), and root mean square roughness (Rq).Taguchi technique L2...
متن کاملThe Bichromatic Square and Rectangle Problems
We examine a variant of the maximum empty square (or rectangle) problem: Find an axis-aligned square (or rectangle) that contains as many blue points as possible without containing any red points. Let n be the total number of red and blue points. We solve the bichromatic square problem in O(n log n) time and O(n) space. We also solve the bichromatic rectangle problem in O(n log n) time and O(n ...
متن کامل